The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions
نویسندگان
چکیده
The trellis complexity of the Preparata and Goethals codes is examined. It is shown that at least for a given set of permutations these codes are rectangular. Upper bounds on the state complexity profiles of the Preparata and Goethals codes are given. The upper bounds on the state complexity of the Preparata and Goethals codes are determined by the DLP of the extended primitive doubleand tripleerror-correcting BCH codes, respectively. A twisted squaring construction for the Preparata and Goethals codes is given, based on the doubleand triple-error-correcting extended primitive BCH codes, respectively.
منابع مشابه
The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes
The structure of the twisted squaring construction, a generalization of the squaring construction, is studied with respect to trellis diagrams and complexity. We show that binary affine-invariant codes, which include the extended primitive BCH codes, and the extended binary quadratic-residue codes, are equivalent to twisted squaring construction codes. In particular, a recursive symmetric rever...
متن کاملOn the Trellis Representation of the Delsarte-Goethals Codes
In this correspondence, the trellis representation of the Kerdock and Delsarte–Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m; ) under any bit-order are either strict-sense nonmerging or strict-sense nonexpanding, except, maybe, at indices within the code’s distance set. For 3 and for m 6, the state complexity, smax[DG(m; )], is found. For all value...
متن کاملThe Z4-linearity of Kerdock, Preparata, Goethals, and related codes
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over Z4, the integers mod 4 (although this requires a slight modificat...
متن کامل4 - Linearity of Kerdock , Preparata , Goethals and Related Codes ∗
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over 4, the integers mod 4 (although this requires a slight modificati...
متن کاملFurther Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4
This paper contains results on the generalized Hamming weights for the Goethals and Preparata codes over Z 4 : We give an upper bound on the rth generalized Hamming weights d r (m; j) for the Goethals code G m (j) of length 2 m over Z 4 , when m is odd. We also determine d 3:5 (m; j) exactly. The upper bound is shown to be tight up to r = 3:5. Furthermore we determine the rth generalized Hammin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999